Sciweavers

8294 search results - page 401 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
IUI
2009
ACM
16 years 1 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
16 years 7 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
PAMI
2006
136views more  PAMI 2006»
15 years 6 months ago
Data Driven Image Models through Continuous Joint Alignment
This paper presents a family of techniques that we call congealing for modeling image classes from data. The idea is to start with a set of images and make them appear as similar a...
Erik G. Learned-Miller
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
16 years 27 days ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
CASES
2006
ACM
15 years 10 months ago
High-performance packet classification algorithm for many-core and multithreaded network processor
Packet classification is crucial for the Internet to provide more value-added services and guaranteed quality of service. Besides hardware-based solutions, many software-based cla...
Duo Liu, Bei Hua, Xianghui Hu, Xinan Tang