Sciweavers

440 search results - page 30 / 88
» Learning the structure of manifolds using random projections
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 3 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
MINENET
2006
ACM
14 years 2 months ago
SVM learning of IP address structure for latency prediction
We examine the ability to exploit the hierarchical structure of Internet addresses in order to endow network agents with predictive capabilities. Specifically, we consider Suppor...
Robert Beverly, Karen R. Sollins, Arthur Berger
CVPR
2007
IEEE
14 years 10 months ago
Learning Conditional Random Fields for Stereo
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
Daniel Scharstein, Chris Pal
IJRR
2007
186views more  IJRR 2007»
13 years 8 months ago
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields
Learning patterns of human behavior from sensor data is extremely important for high-level activity inference. We show how to extract a person’s activities and significant plac...
Lin Liao, Dieter Fox, Henry A. Kautz
HT
2000
ACM
14 years 24 days ago
Reusable hypertext structures for distance and JIT learning
Software components for distance and just-in-time (JIT) learning are an increasingly common method of encouraging reuse and facilitating the development process[58], but no analog...
Anne Morgan Spalter, Rosemary Michelle Simpson