Sciweavers

4908 search results - page 967 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
BMCBI
2007
144views more  BMCBI 2007»
14 years 11 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
CN
2007
117views more  CN 2007»
14 years 11 months ago
Cellular universal IP for nested network mobility
In recent years, network mobility (NEMO) has been studied extensively due to its potential applications in military and public transportation. NEMO basic support protocol (NBSP), ...
Patrick P. Lam, Soung C. Liew, Jack Y. B. Lee
121
Voted
ISCI
2008
165views more  ISCI 2008»
14 years 11 months ago
Support vector regression from simulation data and few experimental samples
This paper considers nonlinear modeling based on a limited amount of experimental data and a simulator built from prior knowledge. The problem of how to best incorporate the data ...
Gérard Bloch, Fabien Lauer, Guillaume Colin...
COMGEO
2007
ACM
14 years 11 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
JAIR
2008
102views more  JAIR 2008»
14 years 11 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang