Sciweavers

1404 search results - page 231 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICML
2006
IEEE
16 years 6 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
GD
2005
Springer
15 years 11 months ago
Incremental Connector Routing
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
TAPSOFT
1997
Springer
15 years 10 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
CASES
2004
ACM
15 years 9 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
AAAI
2008
15 years 8 months ago
Instance-level Semisupervised Multiple Instance Learning
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
Yangqing Jia, Changshui Zhang