Sciweavers

736 search results - page 99 / 148
» High-order functions and their ordering relations
Sort
View
FOCS
2010
IEEE
15 years 4 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
NAR
2000
182views more  NAR 2000»
15 years 5 months ago
tmRDB (tmRNA database)
Maintained at the University of Texas Health Science Center at Tyler, Texas, the tmRNA database (tmRDB) is accessible at the URL http://psyche.uthct.edu/dbs/ tmRDB/tmRDB.html with...
Christian Zwieb, Jacek Wower
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
16 years 8 days ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
13 years 8 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
ATAL
2009
Springer
16 years 21 days ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...