Sciweavers

    6045 search results - page 1046 / 1209
    » Computable Linearizations of Well-partial-orderings
    Sort
    View
    SDM
    2008
    SIAM
    117views Data Mining» more  SDM 2008»
    A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
    13 years 10 months ago
    A Feature Selection Algorithm Capable of Handling Extremely Large Data Dimensionality
    Download  vk.cs.umn.edu
    With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
    Yijun Sun, Sinisa Todorovic, Steve Goodison
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    Maintaining deforming surface meshes
    13 years 10 months ago
    Maintaining deforming surface meshes
    Download  www.cse.ohio-state.edu
    We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
    Siu-Wing Cheng, Tamal K. Dey
    claim paper
    Read More »
    AAAI
    2006
    134views Intelligent Agents» more  AAAI 2006»
    Point-based Dynamic Programming for DEC-POMDPs
    13 years 10 months ago
    Point-based Dynamic Programming for DEC-POMDPs
    Download  hal.archives-ouvertes.fr
    We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
    Daniel Szer, François Charpillet
    claim paper
    Read More »
    AIPS
    2006
    171views Artificial Intelligence» more  AIPS 2006»
    Goal Achievement in Partially Known, Partially Observable Domains
    13 years 10 months ago
    Goal Achievement in Partially Known, Partially Observable Domains
    Download  www.aaai.org
    We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
    Allen Chang, Eyal Amir
    claim paper
    Read More »
    FIMI
    2004
    239views Data Mining» more  FIMI 2004»
    LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
    13 years 10 months ago
    LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
    Download  sunsite.informatik.rwth-aachen.de
    : For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
    Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
    claim paper
    Read More »
    « Prev « First page 1046 / 1209 Last » Next »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.