Sciweavers

746 search results - page 41 / 150
» Fast (Structured) Newton Computations
Sort
View
ACL
2012
12 years 1 months ago
Fast Syntactic Analysis for Statistical Language Modeling via Substructure Sharing and Uptraining
Long-span features, such as syntax, can improve language models for tasks such as speech recognition and machine translation. However, these language models can be difficult to u...
Ariya Rastrow, Mark Dredze, Sanjeev Khudanpur
ISMAR
2006
IEEE
14 years 5 months ago
Hybrid tracking algorithms for planar and non-planar structures subject to illumination changes
Augmented Reality (AR) aims to fuse a virtual world and a real one in an image stream. When considering only a vision sensor, it relies on registration techniques that have to be ...
Muriel Pressigout, Éric Marchand
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 8 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
14 years 2 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 11 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup