Sciweavers

558 search results - page 78 / 112
» Trees and Matchings
Sort
View
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 1 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
AAAI
1994
15 years 1 months ago
Using Induction to Refine Information Retrieval Strategies
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
Catherine Baudin, Barney Pell, Smadar Kedar
COMCOM
2010
90views more  COMCOM 2010»
14 years 12 months ago
The room shortage problem of tree-based ZigBee/IEEE 802.15.4 wireless networks
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
Li-Hsing Yen, Wei-Ting Tsai
WWW
2006
ACM
16 years 16 days ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
SPAA
2009
ACM
16 years 12 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman