Sciweavers

73 search results - page 10 / 15
» Projective-planar signed graphs and tangled signed graphs
Sort
View
EJC
2007
13 years 7 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
ACL
2010
13 years 5 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
VIS
2009
IEEE
215views Visualization» more  VIS 2009»
14 years 8 months ago
Iconizer: A Framework to Identify and Create Effective Representations for Visual Information Encoding
concept form search query vision confirm consensus refine search query graphics VIE-designer image objects image objects Visual Sign (VIE) run search query words images Iconizer:...
Supriya Garg, Tamara Berg, Klaus Mueller
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty