Sciweavers

2150 search results - page 228 / 430
» On a restricted cross-intersection problem
Sort
View
144
Voted
ICML
2004
IEEE
16 years 4 months ago
Generative modeling for continuous non-linearly embedded visual inference
Many difficult visual perception problems, like 3D human motion estimation, can be formulated in terms of inference using complex generative models, defined over high-dimensional ...
Cristian Sminchisescu, Allan D. Jepson
145
Voted
WWW
2007
ACM
16 years 4 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
133
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 4 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 4 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
PODS
2004
ACM
98views Database» more  PODS 2004»
16 years 4 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher