934 search results - page 131 / 187 » A theoretical analysis of the HIFF problem |
COLCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—In many applications, transaction data arrive in the form of high speed data streams. These data contain a lot of information about customers that needs to be carefully managed ...
SIBGRAPI
2005
IEEE
15 years 3 months ago
2005
IEEE
The design of W-operators from a set of input/output examples for large windows is a hard problem. From the statistical standpoint, it is hard because of the large number of examp...
109
click to vote
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
102
click to vote
APWEB
2006
Springer
15 years 1 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
122
click to vote
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...