Sciweavers

2523 search results - page 171 / 505
» Objective: In Minimum Context
Sort
View
134
Voted
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 4 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
FOCS
2004
IEEE
15 years 8 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
JSAC
2007
132views more  JSAC 2007»
15 years 4 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...
AVI
2008
15 years 6 months ago
The in-context slider: a fluid interface component for visualization and adjustment of values while authoring
As information environments grow in complexity, we yearn for simple interfaces that streamline human cognition and effort. Users need to perform complex operations on thousands of...
Andrew Webb, Andruid Kerne
ICML
1996
IEEE
16 years 5 months ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki