Sciweavers

1648 search results - page 320 / 330
» On the generation of bicliques of a graph
Sort
View
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
CIKM
2008
Springer
13 years 9 months ago
Predicting web spam with HTTP session information
Web spam is a widely-recognized threat to the quality and security of the Web. Web spam pages pollute search engine indexes, burden Web crawlers and Web mining services, and expos...
Steve Webb, James Caverlee, Calton Pu
AVI
2010
13 years 9 months ago
Wakame: sense making of multi-dimensional spatial-temporal data
As our ability to measure the world around us improves, we are quickly generating massive quantities of high-dimensional, spatial-temporal data. In this paper, we concern ourselve...
Clifton Forlines, Kent Wittenburg
DAGSTUHL
2001
13 years 8 months ago
Visualization for the Mind's Eye
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
Nelson A. Baloian, Wolfram Luther
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 8 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta