Sciweavers

3119 search results - page 540 / 624
» General Default Logic
Sort
View
CAGD
2010
125views more  CAGD 2010»
14 years 10 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 9 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
88
Voted
COLING
2010
14 years 7 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
IJMHCI
2011
249views more  IJMHCI 2011»
14 years 7 months ago
3D Talking-Head Interface to Voice-Interactive Services on Mobile Phones
We present a novel framework for easy creation of interactive, platform-independent voice-services with an animated 3D talking-head interface, on mobile phones. The framework supp...
Jirí Danihelka, Roman Hak, Lukas Kencl, Jir...
TVLSI
2010
14 years 7 months ago
Improving FPGA Performance for Carry-Save Arithmetic
The selective use of carry-save arithmetic, where appropriate, can accelerate a variety of arithmetic-dominated circuits. Carry-save arithmetic occurs naturally in a variety of DSP...
Hadi Parandeh-Afshar, Ajay K. Verma, Philip Brisk,...