Sciweavers

1550 search results - page 197 / 310
» Benchmarking for Graph Transformation
Sort
View
129
Voted
ECML
2006
Springer
15 years 4 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
119
Voted
CASES
2001
ACM
15 years 4 months ago
Computation offloading to save energy on handheld devices: a partition scheme
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
Zhiyuan Li, Cheng Wang, Rong Xu
100
Voted
EURODAC
1995
IEEE
137views VHDL» more  EURODAC 1995»
15 years 4 months ago
A formal non-heuristic ATPG approach
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...
Manfred Henftling, Hannes C. Wittmann, Kurt Antrei...
104
Voted
ICS
1995
Tsinghua U.
15 years 4 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
122
Voted
AAAI
2007
15 years 3 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel