Sciweavers

498 search results - page 49 / 100
» From Language to Time: A Temporal Expression Anchorer
Sort
View
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
15 years 9 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
ASPLOS
2008
ACM
15 years 1 months ago
Efficiency trends and limits from comprehensive microarchitectural adaptivity
Increasing demand for power-efficient, high-performance computing requires tuning applications and/or the underlying hardware to improve the mapping between workload heterogeneity...
Benjamin C. Lee, David Brooks
SCALESPACE
2001
Springer
15 years 4 months ago
Scale-Time Kernels and Models
Receptive field sensitivity profiles of visual front-end cells in the LGN and V1 area in intact animals can be measured with increasing accuracy, both in the spatial and temporal...
Bart M. ter Haar Romeny, Luc Florack, Mads Nielsen
FOCS
1998
IEEE
15 years 4 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
AAAI
1998
15 years 1 months ago
Qualitative Simulation as a Temporally-extended Constraint Satisfaction Problem
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
Daniel J. Clancy, Benjamin Kuipers