Sciweavers

1922 search results - page 298 / 385
» ie 2007
Sort
View
PAMI
2007
176views more  PAMI 2007»
14 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PE
2007
Springer
87views Optimization» more  PE 2007»
14 years 9 months ago
Understanding the simulation of mobility models with Palm calculus
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...
Jean-Yves Le Boudec
PERVASIVE
2007
Springer
14 years 9 months ago
Securing Pocket Hard Drives
Inexpensive portable storage devices that are available in the market today have made it easier for users to carry data and programs with them and borrow computing platforms when ...
Nishkam Ravi, Chandra Narayanaswami, Mandayam T. R...
PRL
2007
98views more  PRL 2007»
14 years 9 months ago
Error probabilities for local extrema in gene expression data
Current approaches for the prediction of functional relations from gene expression data often do not have a clear methodology for extracting features and are not accompanied by a ...
Perry Groot, Christian Gilissen, Michael Egmont-Pe...
ACL
2011
14 years 1 months ago
Domain Adaptation by Constraining Inter-Domain Variability of Latent Feature Representation
We consider a semi-supervised setting for domain adaptation where only unlabeled data is available for the target domain. One way to tackle this problem is to train a generative m...
Ivan Titov