Sciweavers

3510 search results - page 567 / 702
» Searching with numbers
Sort
View
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 5 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
SAC
2010
ACM
15 years 5 months ago
Host-IP clustering technique for deep web characterization
—A huge portion of todays Web consists of web pages filled with information from myriads of online databases. This part of the Web, known as the deep Web, is to date relatively ...
Denis Shestakov, Tapio Salakoski
TRANSCI
2010
128views more  TRANSCI 2010»
15 years 4 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List
WINET
2010
128views more  WINET 2010»
15 years 4 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...