Sciweavers

127 search results - page 10 / 26
» Mode Directed Path Finding
Sort
View
SIAMDM
2010
95views more  SIAMDM 2010»
14 years 4 months ago
Voting Paths
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...
David J. Abraham, Telikepalli Kavitha
81
Voted
SIGSOFT
2003
ACM
15 years 10 months ago
Tracking pointers with path and context sensitivity for bug detection in C programs
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
V. Benjamin Livshits, Monica S. Lam
ICML
2009
IEEE
15 years 10 months ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos
86
Voted
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
15 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
UIST
2010
ACM
14 years 7 months ago
Pen + touch = new tools
We describe techniques for direct pen+touch input. We observe people's manual behaviors with physical paper and notebooks. These serve as the foundation for a prototype Micro...
Ken Hinckley, Koji Yatani, Michel Pahud, Nicole Co...