Sciweavers

10493 search results - page 1757 / 2099
» Dynamic Word Problems
Sort
View
CP
2009
Springer
16 years 4 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 3 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
CHI
2007
ACM
16 years 3 months ago
Enhancing ubiquitous computing with user interpretation: field testing the home health horoscope
Domestic ubiquitous computing systems often rely on inferences about activities in the home, but the open-ended, dynamic and heterogeneous nature of the home poses serious problem...
William W. Gaver, Phoebe Sengers, Tobie Kerridge, ...
HPCA
2005
IEEE
16 years 3 months ago
A Small, Fast and Low-Power Register File by Bit-Partitioning
A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ...
Masaaki Kondo, Hiroshi Nakamura
RECOMB
2003
Springer
16 years 3 months ago
On de novo interpretation of tandem mass spectra for peptide identification
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
Vineet Bafna, Nathan Edwards
« Prev « First page 1757 / 2099 Last » Next »