Sciweavers

6110 search results - page 1114 / 1222
» Approximate Computing
Sort
View
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 9 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
INFORMS
1998
150views more  INFORMS 1998»
15 years 5 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
AAAI
2008
15 years 8 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang
CGF
2005
204views more  CGF 2005»
15 years 6 months ago
BRDF and geometry capture from extended inhomogeneous samples using flash photography
We present a technique which allows capture of 3D surface geometry and a useful class of BRDFs using extremely simple equipment. A standard digital camera with an attached flash s...
James A. Paterson, David Claus, Andrew W. Fitzgibb...
IPPS
2010
IEEE
15 years 4 months ago
Out-of-core distribution sort in the FG programming environment
We describe the implementation of an out-of-core, distribution-based sorting program on a cluster using FG, a multithreaded programming framework. FG mitigates latency from disk-I/...
Priya Natarajan, Thomas H. Cormen, Elena Riccio St...
« Prev « First page 1114 / 1222 Last » Next »