Sciweavers

1650 search results - page 211 / 330
» The HOM problem is decidable
Sort
View
ICPR
2008
IEEE
16 years 25 days ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
AAIM
2008
Springer
120views Algorithms» more  AAIM 2008»
16 years 23 days ago
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
Gregory Gutin, Arash Rafiey, Anders Yeo
CIDM
2007
IEEE
16 years 23 days ago
Reactive Query Policies: A Formalism for Planning with Volatile External Information
— To generate plans for collecting data for data mining, an important problem is information volatility during planning: the information needed by the planning system may change ...
Tsz-Chiu Au, Dana S. Nau
ICC
2007
IEEE
16 years 22 days ago
A Novel Piggyback Selection Scheme in IEEE 802.11e HCCA
— A control frame can be piggybacked in a data frame to increase the channel efficiency in a wireless communication such as IEEE 802.11 WLAN. However, the piggyback scheme may c...
Hyun-Jin Lee, Jae-Hyun Kim, Sunghyun Cho
ATAL
2007
Springer
16 years 18 days ago
Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM
Abstract. We present a fast and effective bidding strategy for the Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM, manufacturers compete to procure com...
Amy R. Greenwald, Victor Naroditskiy, Tyler Odean,...