Sciweavers

9841 search results - page 1597 / 1969
» Distributed Value Functions
Sort
View
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 8 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
AAAI
2010
15 years 8 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
BCSHCI
2008
15 years 8 months ago
Low cost prototyping: part 2, or how to apply the thinking-aloud method efficiently
Customer satisfaction with regard to user interfaces becomes increasingly more important and is, eventually, decisive for the selection of systems within a competitive market. End...
Andreas Holzinger, Stephen Brown
BILDMED
2007
107views Algorithms» more  BILDMED 2007»
15 years 8 months ago
Whole Body MRI Intensity Standardization
Abstract. A major problem of segmentation of magnetic resonance images is that intensities are not standardized like in computed tomography. This article deals with the correction ...
Florian Jäger, László G. Ny&uac...
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 8 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
« Prev « First page 1597 / 1969 Last » Next »