6274 search results - page 1223 / 1255 » From query complexity to computational complexity |
121
Voted
DSVIS
2003
Springer
15 years 9 months ago
2003
Springer
CAD systems have yet to become usable at the early stages of product ideation, where precise shape definitions and sometimes even design intentions are not fully developed. To over...
119
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
143
Voted
IDEAL
2003
Springer
15 years 9 months ago
2003
Springer
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
234
click to vote
AGP
2010
IEEE
15 years 8 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
117
Voted
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
One trend in day-to-day computing involves moving seamlessly from large powerful workstations to small handheld devices. A second trend is continuous collaboration with colleagues...