Sciweavers

385 search results - page 3 / 77
» On higher-order perceptron algorithms
Sort
View
CVPR
2009
IEEE
15 years 27 days ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
POPL
2009
ACM
14 years 6 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
CGF
2000
83views more  CGF 2000»
13 years 5 months ago
A novel approach makes higher order wavelets really efficient for radiosity
Since wavelets were introduced in the radiosity algorithm5, surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previou...
François Cuny, Laurent Alonso, Nicolas Holz...
AUSDM
2007
Springer
84views Data Mining» more  AUSDM 2007»
13 years 12 months ago
Detecting Anomalous Longitudinal Associations Through Higher Order Mining
The detection of unusual or anomalous data is an important function in automated data analysis or data mining. However, the diversity of anomaly detection algorithms shows that it...
Ping Liang, John F. Roddick
COMPGEOM
1994
ACM
13 years 10 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...