19798 search results - page 3798 / 3960 » Is Structural Subtyping Useful |
133
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
147
click to vote
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
We introduce a new visual search interface for search engines. The interface is a user-friendly and informative graphical front-end for organizing and presenting search results in...
152
click to vote
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
144
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
148
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Database storage managers have long been able to efficiently handle multiple concurrent requests. Until recently, however, a computer contained only a few single-core CPUs, and th...