Sciweavers

2526 search results - page 281 / 506
» A New Algorithm for Answer Set Computation
Sort
View
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 10 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
VISUALIZATION
2005
IEEE
16 years 4 days ago
Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, ou...
Steven P. Callahan, João Luiz Dihl Comba, P...
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
COMAD
2009
15 years 7 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
ENTCS
2002
77views more  ENTCS 2002»
15 years 6 months ago
Trivial Reals
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...