Sciweavers

1733 search results - page 308 / 347
» Digital data networks design using genetic algorithms
Sort
View
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CIKM
2006
Springer
14 years 17 days ago
Knowing a web page by the company it keeps
Web page classification is important to many tasks in information retrieval and web mining. However, applying traditional textual classifiers on web data often produces unsatisfyi...
Xiaoguang Qi, Brian D. Davison
JSAC
2007
180views more  JSAC 2007»
13 years 8 months ago
Cooperative Distributed MIMO Channels in Wireless Sensor Networks
— The large number of network nodes and the energy constraints make Wireless Sensor Networks (WSN) one of the most important application fields for Cooperative Diversity. Node c...
Aitor del Coso, Umberto Spagnolini, Christian Ibar...
WSDM
2009
ACM
117views Data Mining» more  WSDM 2009»
14 years 3 months ago
Query by document
We are experiencing an unprecedented increase of content contributed by users in forums such as blogs, social networking sites and microblogging services. Such abundance of conten...
Yin Yang, Nilesh Bansal, Wisam Dakka, Panagiotis G...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 9 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour