Sciweavers

    5639 search results - page 1108 / 1128
    » Timed Abstract Non-interference
    Sort
    View
    NETWORK
    2008
    107views more  NETWORK 2008»
    HiCon: a hierarchical context monitoring and composition framework for next-generation context-aware services
    14 years 9 months ago
    HiCon: a hierarchical context monitoring and composition framework for next-generation context-aware services
    Download  nclab.kaist.ac.kr
    This article presents a hierarchical context monitoring and composition framework that effectively supports next-generation context-aware services. The upcoming ubiquitous space w...
    Kyungmin Cho, Inseok Hwang, Seungwoo Kang, Byoungj...
    claim paper
    Read More »
    ETT
    2007
    90views Education» more  ETT 2007»
    Algorithms and applications of channel impulse response length estimation for MIMO-OFDM
    14 years 9 months ago
    Algorithms and applications of channel impulse response length estimation for MIMO-OFDM
    Download  www.vodafone-chair.com
    Abstract— The performance of the widely applied timedomain channel estimation for SISO- and MIMO-OFDM systems strongly depends on the preciseness of information regarding maximum...
    Marco Krondorf, Ting-Jung Liang, M. Goblirsch, Ger...
    claim paper
    Read More »
    FUIN
    2007
    129views more  FUIN 2007»
    Sound Isolation by Harmonic Peak Partition For Music Instrument Recognition
    14 years 9 months ago
    Sound Isolation by Harmonic Peak Partition For Music Instrument Recognition
    Download  www.mir.uncc.edu
    Abstract. Identification of music instruments in polyphonic sounds is difficult and challenging, especially where heterogeneous harmonic partials are overlapping with each other....
    Xin Zhang, Zbigniew W. Ras
    claim paper
    Read More »
    PAMI
    2008
    152views more  PAMI 2008»
    K-Nearest Neighbor Finding Using MaxNearestDist
    14 years 9 months ago
    K-Nearest Neighbor Finding Using MaxNearestDist
    Download  www.cs.umd.edu
    Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
    Hanan Samet
    claim paper
    Read More »
    SIAMSC
    2008
    129views more  SIAMSC 2008»
    Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
    14 years 9 months ago
    Bottom-Up Construction and 2: 1 Balance Refinement of Linear Octrees in Parallel
    Download  www.seas.upenn.edu
    Abstract. In this article, we propose new parallel algorithms for the construction and 2:1 balance refinement of large linear octrees on distributed memory machines. Such octrees a...
    Hari Sundar, Rahul S. Sampath, George Biros
    claim paper
    Read More »
    « Prev « First page 1108 / 1128 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-2025, USA.