Sciweavers

9871 search results - page 1866 / 1975
» On the Structure of Low Sets
Sort
View
SPAA
2009
ACM
16 years 1 months ago
Weak graph colorings: distributed algorithms and applications
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...
Fabian Kuhn
WSDM
2009
ACM
158views Data Mining» more  WSDM 2009»
16 years 1 months ago
A new visual search interface for web browsing
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...
Songhua Xu, Tao Jin, Francis Chi-Moon Lau
BIRTHDAY
2009
Springer
16 years 1 months ago
Vertical Object Layout and Compression for Fixed Heaps
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...
Ben Titzer, Jens Palsberg
EDBT
2009
ACM
138views Database» more  EDBT 2009»
16 years 1 months ago
FOGGER: an algorithm for graph generator discovery
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...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 1 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
« Prev « First page 1866 / 1975 Last » Next »