Sciweavers

3328 search results - page 345 / 666
» On Plateaued Functions and Their Constructions
Sort
View
MIR
2005
ACM
140views Multimedia» more  MIR 2005»
16 years 12 days ago
Multiple random walk and its application in content-based image retrieval
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying M...
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
16 years 11 days ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
FOCS
2002
IEEE
15 years 11 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
ISESE
2002
IEEE
15 years 11 months ago
Elimination of Crucial Faults by a New Selective Testing Method
Recent software systems contain a lot of functions to provide various services. According to this tendency, software testing becomes more difficult than before and cost of testing...
Masayuki Hirayama, Tetsuya Yamamoto, Jiro Okayasu,...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 11 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...