Sciweavers

3894 search results - page 535 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
CEC
2008
IEEE
15 years 10 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
ICML
2010
IEEE
15 years 5 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
IJBRA
2007
80views more  IJBRA 2007»
15 years 3 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
ICPP
2008
IEEE
15 years 10 months ago
Fast Source Switching for Gossip-Based Peer-to-Peer Streaming
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
Zhenhua Li, Jiannong Cao, Guihai Chen, Yan Liu
139
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...