Sciweavers

10072 search results - page 1537 / 2015
» Composition of Model Programs
Sort
View
CGO
2008
IEEE
16 years 1 months ago
Prediction and trace compression of data access addresses through nested loop recognition
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
Alain Ketterlin, Philippe Clauss
ILP
2007
Springer
16 years 1 months ago
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
Ganesh Ramakrishnan, Sachindra Joshi, Sreeram Bala...
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
16 years 18 days ago
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fa...
INFOCOM
2005
IEEE
16 years 17 days ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 16 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
« Prev « First page 1537 / 2015 Last » Next »