Sciweavers

439 search results - page 80 / 88
» Unnesting Arbitrary Queries
Sort
View
FOCS
1990
IEEE
14 years 1 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
DEBS
2008
ACM
13 years 11 months ago
Extending Siena to support more expressive and flexible subscriptions
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
John Keeney, Dominik Roblek, Dominic Jones, David ...
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
WWW
2002
ACM
14 years 10 months ago
OCTOPUS: aggressive search of multi-modality data using multifaceted knowledge base
An important trend in Web information processing is the support of multimedia retrieval. However, the most prevailing paradigm for multimedia retrieval, content-based retrieval (C...
Jun Yang 0003, Qing Li, Yueting Zhuang
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 10 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais