Sciweavers

1127 search results - page 115 / 226
» Testing the Expansion of a Graph
Sort
View
ICML
1998
IEEE
15 years 10 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
CHI
2007
ACM
15 years 10 months ago
Endpoint prediction using motion kinematics
Recently proposed novel interaction techniques such as cursor jumping [1] and target expansion for tiled arrangements [13] are predicated on an ability to effectively estimate the...
Edward Lank, Yi-Chun Nikko Cheng, Jaime Ruiz
ICFP
2001
ACM
15 years 10 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Isosurfaces Over Simplicial Partitions of Multiresolution Grids
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
Josiah Manson and Scott Schaefer
ASPLOS
2010
ACM
15 years 4 months ago
Specifying and dynamically verifying address translation-aware memory consistency
Computer systems with virtual memory are susceptible to design bugs and runtime faults in their address translation (AT) systems. Detecting bugs and faults requires a clear speciï...
Bogdan F. Romanescu, Alvin R. Lebeck, Daniel J. So...