Sciweavers

413 search results - page 2 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
IPPS
1998
IEEE
13 years 9 months ago
Multiprocessor Scheduling Using Mean-Field Annealing
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
Shaharuddin Salleh, Albert Y. Zomaya
CORR
2011
Springer
204views Education» more  CORR 2011»
12 years 11 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
PSYCHNOLOGY
2007
96views more  PSYCHNOLOGY 2007»
13 years 4 months ago
A First-time Wireless Internet Connection: More Than Just Clicking on a Link
In the context of understanding the particular use made of nomad Internet and mobile computing in its interactional dimension, this article examines the detail of a first-time con...
Dimitri Voilmy, Karine Lan Hing Ting
FLAIRS
2004
13 years 6 months ago
A Faster Algorithm for Generalized Multiple-Instance Learning
In our prior work, we introduced a generalization of the multiple-instance learning (MIL) model in which a bag's label is not based on a single instance's proximity to a...
Qingping Tao, Stephen D. Scott
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 6 months ago
Faster join-projects and sparse matrix multiplications
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
Rasmus Resen Amossen, Rasmus Pagh