Sciweavers

3656 search results - page 297 / 732
» Compact Location Problems
Sort
View
193
Voted
SIGIR
2004
ACM
16 years 3 days ago
Locality preserving indexing for document representation
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
16 years 2 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
AUSAI
2004
Springer
16 years 2 days ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
CDB
2004
Springer
143views Database» more  CDB 2004»
16 years 2 days ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
16 years 2 days ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...