Sciweavers

4315 search results - page 177 / 863
» Sorting in linear time
Sort
View
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
14 years 26 days ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
14 years 10 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
14 years 1 months ago
Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
Davood Rafiei, Alberto O. Mendelzon
DISOPT
2010
138views more  DISOPT 2010»
13 years 9 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
JCSS
2000
116views more  JCSS 2000»
13 years 9 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow