Sciweavers

7264 search results - page 1299 / 1453
» A multiplicative up-propagation algorithm
Sort
View
JAIR
2007
113views more  JAIR 2007»
15 years 4 months ago
Chain: A Dynamic Double Auction Framework for Matching Patient Agents
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a res...
Jonathan Bredin, David C. Parkes, Quang Duong
TKDE
2008
191views more  TKDE 2008»
15 years 4 months ago
Beyond Single-Page Web Search Results
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit fo...
Ramakrishna Varadarajan, Vagelis Hristidis, Tao Li
TNN
2008
152views more  TNN 2008»
15 years 4 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
TON
2008
100views more  TON 2008»
15 years 4 months ago
Impact of hot-potato routing changes in IP networks
Abstract-- Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Bo...
Renata Teixeira, Aman Shaikh, Timothy G. Griffin, ...
JGT
2007
73views more  JGT 2007»
15 years 4 months ago
New bounds on the edge number of a k-map graph
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
Zhi-Zhong Chen
« Prev « First page 1299 / 1453 Last » Next »