Sciweavers

178 search results - page 15 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
FDG
2009
ACM
14 years 3 months ago
An exploration of menu techniques using a 3D game input device
Existing work on menu techniques has shown linear menus to be less efficient and reliable for menuing tasks when compared to radial menus. With the rise in popularity of 3D spatia...
Dustin B. Chertoff, Ross W. Byers, Joseph J. LaVio...
CVPR
2009
IEEE
14 years 3 months ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
14 years 11 days ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 3 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri