Sciweavers

1265 search results - page 144 / 253
» Algorithms for Drawing Media
Sort
View
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 1 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
CHI
2009
ACM
15 years 8 months ago
Make new friends, but keep the old: recommending people on social networking sites
This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender al...
Jilin Chen, Werner Geyer, Casey Dugan, Michael J. ...
145
Voted
AOSD
2007
ACM
15 years 8 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
JSAT
2008
113views more  JSAT 2008»
15 years 4 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
155
Voted
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 10 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen