Sciweavers

1631 search results - page 228 / 327
» Uniform Distributed Synthesis
Sort
View
WWW
2011
ACM
14 years 10 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh
ICDCS
2003
IEEE
15 years 8 months ago
Enhancing The Fault-Tolerance of Nonmasking Programs
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
Sandeep S. Kulkarni, Ali Ebnenasir
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 4 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
DAC
1999
ACM
16 years 4 months ago
A Novel VLSI Layout Fabric for Deep Sub-Micron Applications
We propose a new VLSI layout methodology which addresses the main problems faced in Deep Sub-Micron (DSM) integrated circuit design. Our layout "fabric" scheme eliminate...
Sunil P. Khatri, Amit Mehrotra, Robert K. Brayton,...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 12 days ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...