Sciweavers

26354 search results - page 327 / 5271
» How we refactor, and how we know it
Sort
View
164
Voted
COGSCI
2010
107views more  COGSCI 2010»
15 years 7 months ago
Bootstrapping the Mind: Analogical Processes and Symbol Systems
Human cognition is striking in its brilliance and its adaptability. How do we get that way? How do we move from the nearly helpless state of infants to the cognitive proficiency t...
Dedre Gentner
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
15 years 6 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
ISVC
2010
Springer
15 years 4 months ago
VR Menus: Investigation of Distance, Size, Auto-scale, and Ray Casting vs. Pointer-Attached-to-Menu
We investigate menu distance, size, and related techniques to understand and optimize menu performance in VR. We show how user interaction using ray casting and Pointer-Attached-to...
Kaushik Das, Christoph W. Borst
INFOCOM
2012
IEEE
13 years 9 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
ICML
2007
IEEE
16 years 7 months ago
Modeling changing dependency structure in multivariate time series
We show how to apply the efficient Bayesian changepoint detection techniques of Fearnhead in the multivariate setting. We model the joint density of vector-valued observations usi...
Xiang Xuan, Kevin P. Murphy