Sciweavers

718 search results - page 85 / 144
» Timing Yield Calculation Using an Impulse-Train Approach
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
BTW
2007
Springer
292views Database» more  BTW 2007»
14 years 25 days ago
Effective and Efficient Indexing for Large Video Databases
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
KES
2011
Springer
13 years 3 months ago
Recommendation for English multiple-choice cloze questions based on expected test scores
When students study for multiple-choice cloze tests as the Test of English for International Communication (TOEIC), they tend to repeatedly tackle questions of the same type. In su...
Tomoharu Iwata, Tomoko Kojiri, Takeshi Yamada, Toy...
PPOPP
2010
ACM
13 years 7 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
GI
2007
Springer
14 years 3 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck