Sciweavers

4850 search results - page 374 / 970
» Approximate Data Structures with Applications
Sort
View
WWW
2003
ACM
16 years 7 months ago
Assisted Browsing for Semistructured Data
The development of the RDF[2] standard highlights the fact that a great deal of useful information is in the form of semistructured data--objects connected by relations fitting no...
Vineet Sinha, David R. Karger, David Huynh
168
Voted
ICST
2010
IEEE
15 years 5 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
PPOPP
2010
ACM
16 years 4 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 23 days ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
KDD
2003
ACM
144views Data Mining» more  KDD 2003»
16 years 7 months ago
Clinical and financial outcomes analysis with existing hospital patient records
Existing patient records are a valuable resource for automated outcomes analysis and knowledge discovery. However, key clinical data in these records is typically recorded in unst...
R. Bharat Rao, Sathyakama Sandilya, Radu Stefan Ni...