Sciweavers

10493 search results - page 1581 / 2099
» Dynamic Word Problems
Sort
View
194
Voted
DBA
2006
236views Database» more  DBA 2006»
15 years 6 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
15 years 5 months ago
On-Line File Caching
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
Neal E. Young
144
Voted
AI
2008
Springer
15 years 4 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 4 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
CN
2010
149views more  CN 2010»
15 years 4 months ago
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
Rubén Cuevas Rumín, Ángel Cue...
« Prev « First page 1581 / 2099 Last » Next »