Sciweavers

2693 search results - page 373 / 539
» On Computing Complex Navigation Functions
Sort
View
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
16 years 21 days ago
Locally Constrained Support Vector Clustering
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
Dragomir Yankov, Eamonn J. Keogh, Kin Fai Kan
INFOCOM
2007
IEEE
16 years 21 days ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
EUROCRYPT
2007
Springer
16 years 16 days ago
Zero Knowledge and Soundness Are Symmetric
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
Shien Jin Ong, Salil P. Vadhan
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 16 days ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 16 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn