Sciweavers

1220 search results - page 100 / 244
» Restricting grammatical complexity
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Irregular pattern matching using projections
Recently, a novel approach to pattern matching was introduced, which reduces time complexity by two orders of magnitude over traditional approaches. It uses an efficient projectio...
Michal Ben-Yehuda, Lihi Cadany, Hagit Hel-Or
ICIP
2003
IEEE
14 years 9 months ago
Lapped spectral decomposition for 3D triangle mesh compression
Spectral decomposition of mesh geometry has first been introduced by Taubin for geometry processing purposes. It has been extended to address transmission issues by Karni & Go...
Benoit M. Macq, François Cayre, Francis J. ...
ICIP
1995
IEEE
14 years 9 months ago
Adaptive overlapping approach for DCT-based motion estimation
The feedback loop for temporal prediction of traditional implementations of an MPEG-compliant video coder requires conversion of images from the spatial domain to the transform do...
Ut-Va Koc, K. J. Ray Liu
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Toward Expressive and Scalable Sponsored Search Auctions
Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the...
David J. Martin, Johannes Gehrke, Joseph Y. Halper...
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 8 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer