Sciweavers

257 search results - page 43 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
AAAI
2010
14 years 11 months ago
Efficient Lifting for Online Probabilistic Inference
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
Aniruddh Nath, Pedro Domingos
NETWORKING
2004
14 years 11 months ago
Fairness Issues in Bus-Based Optical Access Networks
Packet-based optical access ring is becoming a promising solution in metropolitan networks. Its performance depends mainly on how optical resource sharing takes place among the dif...
Nizar Bouabdallah, André-Luc Beylot, Guy Pu...
BMCBI
2011
14 years 1 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
FOCS
2006
IEEE
15 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor
91
Voted
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber