Sciweavers

2498 search results - page 220 / 500
» Data Structures with Unpredictable Timing
Sort
View
COMGEO
2008
ACM
15 years 2 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
SIGKDD
2000
150views more  SIGKDD 2000»
15 years 2 months ago
KDD-Cup 2000 Organizers' Report: Peeling the Onion
We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...
136
Voted
ECCV
2004
Springer
16 years 4 months ago
Novel Skeletal Representation for Articulated Creatures
Abstract. Volumetric structures are frequently used as shape descriptors for 3D data. The capture of such data is being facilitated by developments in multi-view video and range sc...
Gabriel J. Brostow, Irfan A. Essa, Drew Steedly, V...
139
Voted
SG
2009
Springer
15 years 9 months ago
Feature-Driven Volume Fairing
Abstract. Volume datasets have been a primary representation for scientific visualization with the advent of rendering algorithms such as marching cubes and ray casting. Nonethele...
Shigeo Takahashi, Jun Kobayashi, Issei Fujishiro
131
Voted
NIPS
2008
15 years 3 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould