Sciweavers

290 search results - page 55 / 58
» Temporal Analysis of Semantic Graphs Using ASALSAN
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Completing wikipedia's hyperlink structure through dimensionality reduction
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
Robert West, Doina Precup, Joelle Pineau
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
13 years 8 months ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu
COGCOM
2011
228views more  COGCOM 2011»
13 years 2 months ago
Clustering of Gaze During Dynamic Scene Viewing is Predicted by Motion
Where does one attend when viewing dynamic scenes? Research into the factors influencing gaze location during static scene viewing have reported that low-level visual features con...
Parag K. Mital, Tim J. Smith, Robin L. Hill, John ...
PLDI
2004
ACM
14 years 15 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
SIGSOFT
2002
ACM
14 years 7 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...