3692 search results - page 502 / 739 » Active learning and its use in computer science |
185
click to vote
SOFSEM
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Large information spaces and complex functionality of contemporary systems together with the advent of the Semantic Web are big challenges for the design of simple yet po...
171
click to vote
WG
2007
Springer
16 years 23 days ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
156
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
148
click to vote
ACSC
2005
IEEE
16 years 9 days ago
2005
IEEE
Ad-hoc networks are frequently used to establish communication in improvised environments without requiring any fixed infrastructure. These networks are formed with the help of t...
185
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...