Sciweavers

2432 search results - page 155 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
SOFSEM
2000
Springer
15 years 8 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
MOBIHOC
2008
ACM
16 years 4 months ago
Efficient configuration and control of sanets using facts
ization of domain-specific programming abstractions for wireless sensor actor networks can greatly ease application development. A high level of abstraction from underlying system...
Kirsten Terfloth, Jochen H. Schiller
ECCV
2004
Springer
16 years 6 months ago
Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
Tamar Avraham, Michael Lindenbaum
ECCV
2008
Springer
16 years 6 months ago
Scale Invariant Action Recognition Using Compound Features Mined from Dense Spatio-temporal Corners
Abstract. The use of sparse invariant features to recognise classes of actions or objects has become common in the literature. However, features are often "engineered" to...
Andrew Gilbert, John Illingworth, Richard Bowden
134
Voted
RECOMB
2006
Springer
16 years 4 months ago
Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation
Abstract. This paper presents a new method for studying protein folding kinetics. It uses the recently introduced Stochastic Roadmap Simulation (SRS) method to estimate the transit...
Tsung-Han Chiang, Mehmet Serkan Apaydin, Douglas L...