Papers.
Research connected to its authors, projects, companies, talks, events, and the rest of the graph.
Add a paper ↗Archer: A Community Distributed Computing Infrastructure for Computer Architecture Research and Education
CollaborateCom · DOI 10.1007/978-3-642-03354-4_7 · arXiv 0807.1765v1 · 18 citations · Source: semantic-scholar+dblpThis paper introduces Archer, a community-based computing infrastructure supporting computer architecture research and education. The Archer system builds on virtualization techniques to provide a collaborative environment that facilitates sharing of computational resources and data among users. It integrates batch scheduling middleware to deliver high-throughput computing services aggregated from resources distributed across wide-area networks and owned by different participating entities in a seamless manner. The paper discusses the motivations that have led to the design of Archer, describes its core middleware components, and presents an analysis of the functionality and performance of the first wide-area deployment of Archer running a representative computer architecture simulation workload.
Oscar Boykin, Renato J. O. Figueiredo, P. Oscar Boykin, José A. B. Fortes, Tao Li 0006, Jie-Kwon Peir, David Wolinsky, Lizy K. John · 13 authors totalUnderstanding the Effects of Sampling on Healthcare Risk Modeling for the Prediction of Future High-Cost Patients
International Joint Conference on Biomedical Engineering Systems and Technologies · DOI 10.1007/978-3-540-92219-3_37 · 4 citations · Source: semantic-scholar+dblp+career-authoritySai Moturu, S. Moturu, Huan Liu, W. Johnson · 4 authors totalClique Analysis of Query Log Graphs
Lecture notes in computer science · DOI 10.1007/978-3-540-89097-3_19 · 8 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Alexandre P. Francisco, Ricardo Baeza‐Yates, Arlindo L. Oliveira · 4 authors totalRequirements Specification Using Fact-Oriented Modeling: A Case Study and Generalization
OTM Workshops · DOI 10.1007/978-3-540-88875-8_98 · 7 citations · Source: personal-publication-catalog+semantic-scholarGabor Melli, Jerre McQuinn · 2 authors totalWatch, Listen & Learn: Co-training on Captioned Images and Videos
ECML/PKDD 2008 · DOI 10.1007/978-3-540-87479-9_48 · 44 citations · Source: semantic-scholarSonal Gupta, Joohyun Kim, K. Grauman, R. Mooney · 4 authors totalWebsite Privacy Preservation for Query Log Publishing
Lecture notes in computer science · DOI 10.1007/978-3-540-78478-4_5 · 19 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Bárbara Poblete, Myra Spiliopoulou, Ricardo Baeza‐Yates · 4 authors totalAgile System Analysis and Design
Lecture notes in business information processing · DOI 10.1007/978-3-540-77581-2_19 · 2 citations · Source: openalexDavid Talby, Yael Dubinsky, Orit Hazzan, Arie Keren · 4 authors totalTowards Semantic Search
Lecture notes in computer science · DOI 10.1007/978-3-540-69858-6_2 · 37 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Ricardo Baeza‐Yates, Massimiliano Ciaramita, Peter Mika, Hugo Zaragoza · 5 authors totalTOCTOU, Traps, and Trusted Computing
Trust and Trustworthy Computing · DOI 10.1007/978-3-540-68979-9_2 · Source: springer+dblp+dartmouth-berkeley-career-authorityEvan R. Sparks, Sergey Bratus, Nihal D'Cunha, Evan Randall Sparks, Sean W. Smith · 5 authors totalExploring the Acceptability of Delayed Reciprocity in Peer-to-Peer Networks
Lecture notes in computer science · DOI 10.1007/978-3-540-68504-3_21 · 2 citations · Source: openalex+orcid+dblp-identityJohan Pouwelse, Jenneke Fokker, Huib de Ridder, Piet Westendorp · 4 authors totalFrom Capturing Semantics to Semantic Search: A Virtuous Cycle
Lecture notes in computer science · DOI 10.1007/978-3-540-68234-9_1 · 13 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Ricardo Baeza‐Yates · 2 authors totalMultimedia Content Description Using Semantic Web Languages
DOI 10.1007/978-1-84800-076-6_2 · 12 citations · Source: openalex+career-authorityOscar Celma, Roberto Garcı́a, Chrisa Tsinaraki, Òscar Celma, Stavros Christodoulakis · 5 authors totalA Survey of Query Auditing Techniques for Data Privacy
Privacy-Preserving Data Mining · DOI 10.1007/978-0-387-70992-5_17 · 43 citations · Source: semantic-scholarShubha Nabar, Shubha U. Nabar, K. Kenthapadi, Nina Mishra, R. Motwani · 5 authors totalDeterministic Searching on the Line
Encyclopedia of Algorithms · DOI 10.1007/978-0-387-30162-4_106 · 0 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Ricardo Baeza‐Yates · 2 authors totalWeb retrieval: Techniques for the aggregation and selection of queries and answers
International Journal of Intelligent Systems · DOI 10.1002/int.20316 · 6 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, David Nettleton, Ricardo Baeza‐Yates · 3 authors totalDomain-independent automatic keyphrase indexing with small training sets
J. Assoc. Inf. Sci. Technol. · DOI 10.1002/asi.20790 · Source: dblp+waikato-thematic-authorityAlyona Medelyan, Olena Medelyan, Ian H. Witten · 3 authors total3D Memories
DOI 10.1002/9783527623051.ch35 · 0 citations · Source: openalex+first-party-career-authorityMark Samuel Tuttle, Mark S. Tuttle · 2 authors totalAnonymizing Unstructured Data
arXiv.org · arXiv 0810.5582 · 32 citations · Source: arxivIn this paper we consider the problem of anonymizing datasets in which each individual is associated with a set of items that constitute private information about the individual. Illustrative datasets include market-basket datasets and search engine query logs. We formalize the notion of k-anonymity for set-valued data as a variant of the k-anonymity model for traditional relational datasets. We define an optimization problem that arises from this definition of anonymity and provide O(klogk) and O(1)-approximation algorithms for the same. We demonstrate applicability of our algorithms to the America Online query log dataset.
Shubha Nabar, R. Motwani, Shubha U. Nabar · 3 authors totalAnonymizing Graphs
arXiv.org · arXiv 0810.5578 · 29 citations · Source: arxivMotivated by recently discovered privacy attacks on social networks, we study the problem of anonymizing the underlying graph of interactions in a social network. We call a graph (k,l)-anonymous if for every node in the graph there exist at least k other nodes that share at least l of its neighbors. We consider two combinatorial problems arising from this notion of anonymity in graphs. More specifically, given an input graph we ask for the minimum number of edges to be added so that the graph becomes (k,l)-anonymous. We define two variants of this minimization problem and study their properties. We show that for certain values of k and l the problems are polynomial-time solvable, while for others they become NP-hard. Approximation algorithms for the latter cases are also given.
Shubha Nabar, T. Feder, Shubha U. Nabar, Evimaria Terzi · 4 authors totalMining Meaning from Wikipedia
CoRR · arXiv 0809.4530 · Source: dblp+waikato-thematic-authorityAlyona Medelyan, Olena Medelyan, Catherine Legg, David N. Milne, Ian H. Witten · 5 authors totalComputing with Classical Real Numbers
arXiv (Cornell University) · DOI 10.48550/arxiv.0809.1644 · 9 citations · Source: openalex+career-authorityRussell O'Connor, Kaliszyk, Cezary, Russell O’Connor · 3 authors totalA Computer Verified Theory of Compact Sets
arXiv (Cornell University) · DOI 10.48550/arxiv.0806.3209 · 3 citations · Source: openalex+career-authorityRussell O'Connor, Russell O’Connor · 2 authors totalCertified Exact Transcendental Real Number Computation in Coq
Radboud Repository (Radboud University) · DOI 10.48550/arxiv.0805.2438 · 40 citations · Source: openalex+career-authorityRussell O'Connor, Russell O’Connor · 2 authors totalTowards the Analysis and Design of Large Scale Networked Systems
0 citations · Source: semantic-scholarRobin Glinton, Paul Scerri, K. Sycara · 3 authors totalTowards Special-Purpose Indexes and Statistics for Uncertain Data
QDB/MUD · 7 citations · Source: semantic-scholarShubha Nabar, A. Sarma, Parag Agrawal, Shubha U. Nabar, J. Widom · 5 authors totalTowards A Distributed Search Engine.
0 citations · Source: openalex+authoritative-profileRicardo Baeza-Yates, Ricardo Baeza‐Yates · 2 authors totalSocial SQL: Tools for Exploring Social Databases
4 citations · Source: openalex+first-party-career-authorityMarc Smith, Marc A. Smith, Vladimir Barash · 3 authors totalSemantic Annotations for Biology: a Corpus Development Initiative at the Jena University Language & Information Engineering (JULIE) Lab.
LREC · Source: dblpKatrin Tomanek, Udo Hahn, Elena Beisswanger, Ekaterina Buyko, Michael Poprat, Joachim Wermter · 6 authors totalSafe type-level abstraction in Scala
FOOL 2008 (Foundations of Object-Oriented Languages) · 14 citations · Source: openalexMost formal accounts of object-oriented languages have focussed on type soundness: the safety that type checking provides with respect to term-level computation and abstractions. However, with type-level abstraction mechanisms becoming increasingly more sophisticated, bringing this guarantee to the level of types has become quite pressing. We call this property kind soundness: kind checking ensures that type constructors are never applied to unexpected type arguments. We present Scalina, a purely object-oriented calculus that employs the same abstraction mechanisms at the type level as well as at the kind level. Soundness for both levels can thus be proven by essentially the same arguments. Kind soundness finally allows designers of type-level abstractions to join their term-level colleagues in relying on the compiler to catch deficiencies before they are discovered by their clients.
Adriaan Moors, Frank Piessens, Martin Odersky · 3 authors totalRobust Submodular Observation Selection
336 citations · Source: semantic-scholarCarlos Guestrin, Andreas Krause, H. B. McMahan, Anupam Gupta · 4 authors totalReshaping Your Business with Web 2.0
McGraw-Hill Osborne Media · Source: publisher+author-careerJean Sini, Vince Casarez, Billy Cripe, Philipp Weckerle · 4 authors totalPronomial Copula Constructions AreWhat? Reduced Specificational Pseudo-Clefts!
14 citations · Source: semantic-scholarVita Markman, V. Markman · 2 authors totalProgramming in Scala
190 citations · Source: openalex1. Getting Started with APM 2. Business Justification 3. Assessments 4. Staffing and Responsibilities 5. APM Patterns 6. The Pilot Evaluation 7. Deployment Strategies 8. Essential Processes 9. Essential Service Capabilities 10. Solution Sizing 11. Load Generation 12. Baselines 13. The Application Audit 14. Triage with Single Metrics 15. Triage with Baselines 16. Triage with Trends 17. Firefighting and Critical Situations
Bill Venners, Martin Odersky, Lex Spoon · 3 authors totalProceedings of the Second international conference on Advances in social network mining and analysis
Social Network Mining and Analysis · 5 citations · Source: openalex+first-party-career-authorityMarc Smith, C. Lee Giles, Marc A. Smith, John Yen, Haizheng Zhang · 5 authors totalProceedings of the First International Workshop on Learning Object Discovery & Exchange, LODE 2007, Sissi, Lassithi - Crete Greece, 18 September, 2007
LODE · 0 citations · Source: semantic-scholar+de-solutionDavid Massart, Jean-Noel Colin, F. Assche · 3 authors totalPhonological Evidence for a Distinction Between Russian Prepositions and Prefixes
25 citations · Source: semantic-scholarAscander Dost, P. Alrenga, Lev Blumenfeld, J. Hankamer, Junko Ito, Jonah Katz · 6 authors totalParser combinators in Scala
KU Leuven CW Report 491 · 37 citations · Source: openalexParser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala's flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we first explain the concept of parser combinators by developing a minimal library from scratch. We then turn to a detailed description of the existing Scala library, including its support for denoting variable binding as part of the syntax. We provide several realistic examples to illustrate the utility of our library.
Adriaan Moors, Frank Piessens, Martin Odersky · 3 authors totalParallel Computation of Integrated Electromagnetic, Thermal and Structural Effects for Accelerator Cavities
LINAC 2008 (SLAC-PUB) · 12 citations · Source: openalex+ostiThe successful operation of accelerator cavities has to satisfy both rf and mechanical requirements. It is highly desirable that electromagnetic, thermal and structural effects such as cavity wall heating and Lorentz force detuning in superconducting rf cavities can be addressed in an integrated analysis. Based on the SLAC parallel finite-element code infrastructure for electromagnetic modeling, a novel multi-physics analysis tool has been developed to include additional thermal and mechanical effects. The parallel computation enables virtual prototyping of accelerator cavities on computers, which would substantially reduce the cost and time of a design cycle. The multi-physics tool is applied to the LCLS rf gun for electromagnetic, thermal and structural analyses.
Arno Candel, Volkan Akcelik, Andreas Kabel, Lie-Quan Lee, Zenghai Li, Cho Ng, Liling Xiao, Kwok Ko · 8 authors total