Sciweavers

2947 search results - page 275 / 590
» Analyzing Program Analyses
Sort
View
FOCM
2007
94views more  FOCM 2007»
15 years 6 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
133
Voted
AMAI
2002
Springer
15 years 6 months ago
Generalizations of Watched Literals for Backtracking Search
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
Allen Van Gelder
197
Voted
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
TWC
2010
15 years 1 months ago
Delay-Minimal Transmission for Average Power Constrained Multi-Access Communications
We investigate the problem of minimizing the overall transmission delay of packets in a multi-access wireless communication system, where the transmitters have average power constr...
Jing Yang, Sennur Ulukus
CHI
2003
ACM
16 years 7 months ago
Media inequality in conversation: how people behave differently when interacting with computers and people
How is interacting with computer programs different from interacting with people? One answer in the literature is that these two types of interactions are similar. The present stu...
Nicole Shechtman, Leonard M. Horowitz