Sciweavers

10890 search results - page 2069 / 2178
» Automatic Complexity Analysis
Sort
View
CHI
2003
ACM
14 years 9 months ago
A context-aware experience sampling tool
A new software tool for user-interface development and assessment of ubiquitous computing applications is available for CHI researchers. The software permits researchers to use co...
Stephen S. Intille, John Rondoni, Chuck Kukla, Isa...
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
RECOMB
2004
Springer
14 years 9 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
CADE
2005
Springer
14 years 9 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 9 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
« Prev « First page 2069 / 2178 Last » Next »