Sciweavers

1705 search results - page 316 / 341
» Representing Constraints with Automata
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 11 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
GIS
2008
ACM
14 years 11 months ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...
DAC
2002
ACM
14 years 11 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...
WWW
2004
ACM
14 years 10 months ago
Through different eyes: assessing multiple conceptual views for querying web services
We present enhancements for UDDI / DAML-S registries allowing cooperative discovery and selection of Web services with a focus on personalization. To find the most useful service ...
Wolf-Tilo Balke, Matthias Wagner
DCC
2009
IEEE
14 years 10 months ago
Compressed Kernel Perceptrons
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
Slobodan Vucetic, Vladimir Coric, Zhuang Wang