11211 search results - page 304 / 2243 » Data Structures |
192
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
187
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In order to structure a gene network, a score-based approach is often used. A score-based approach, however, is problematic because by assuming a probability distribution, one is ...
205
click to vote
CIDR
2003
15 years 8 months ago
2003
With the rapid increase in the use of inexpensive, location-aware sensors in a variety of new applications, large amounts of time-sequenced location data will soon be accumulated....
158
click to vote
ICIS
2004
15 years 8 months ago
2004
Enterprise systems entail complex organizational interventions. Accurately gauging the impact of any complex information system requires understanding its multidimensionality, and...
192
click to vote
MP
2010
15 years 5 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...