Sciweavers

357 search results - page 34 / 72
» An Algebraic Approach to the Complexity of Generalized Conju...
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Constraint-based model synthesis
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
Paul Merrell, Dinesh Manocha
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
GIS
2004
ACM
14 years 9 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SIGIR
2010
ACM
13 years 12 months ago
Estimating advertisability of tail queries for sponsored search
Sponsored search is one of the major sources of revenue for search engines on the World Wide Web. It has been observed that while showing ads for every query maximizes shortterm r...
Sandeep Pandey, Kunal Punera, Marcus Fontoura, Van...