1840 search results - page 209 / 368 » time 2002 |
166
click to vote
TIME
2009
IEEE
15 years 11 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
141
Voted
ICTAI
2009
IEEE
15 years 11 months ago
2009
IEEE
Text classification categories Web documents in large collections into predefined classes based on their contents. Unfortunately, the classification process can be time-consumi...
109
Voted
MM
2004
ACM
15 years 10 months ago
2004
ACM
This essay investigates the peculiar situation of a new media project which takes as its raw material the home-video archive of a deaf man gone blind. In an attempt to revive this...
141
Voted
3DPVT
2002
IEEE
15 years 10 months ago
2002
IEEE
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
131
click to vote
ACSC
2002
IEEE
15 years 10 months ago
2002
IEEE
The majority of the world’s computing resources remains idle most of the time. By using this resource pool, an individual computation may be completed in a fraction of time requ...