Sciweavers

2266 search results - page 320 / 454
» Generalizing parametric timing analysis
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 1 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
172
Voted
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 25 days ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
185
Voted
SIGMOD
2005
ACM
157views Database» more  SIGMOD 2005»
16 years 25 days ago
Meta-data version and configuration management in multi-vendor environments
Nearly all components that comprise modern information technology, such as Computer Aided Software Engineering (CASE) tools, Enterprise Application Integration (EAI) environments,...
John R. Friedrich
97
Voted
MOBIHOC
2003
ACM
16 years 8 days ago
Localization from mere connectivity
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...
Yi Shang, Wheeler Ruml, Ying Zhang, Markus P. J. F...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
15 years 10 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais