Sciweavers

    TON
    1998
    116views more  TON 1998»
    Explicit allocation of best-effort packet delivery service
    13 years 9 months ago
    Explicit allocation of best-effort packet delivery service
    Download  groups.csail.mit.edu
    — This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” fra...
    David D. Clark, Wenjia Fang
    claim paper
    Read More »
    TOG
    1998
    98views more  TOG 1998»
    V-Clip: Fast and Robust Polyhedral Collision Detection
    13 years 9 months ago
    V-Clip: Fast and Robust Polyhedral Collision Detection
    Download  www.merl.com
    This paper presents the Voronoi-clip, or V-clip, collision detection algorithm for polyhedral objects specified by a boundary representation. V-clip tracks the closest pair of fe...
    Brian Mirtich
    claim paper
    Read More »
    SIGKDD
    2002
    83views more  SIGKDD 2002»
    Towards Effective and Interpretable Data Mining by Visual Interaction
    13 years 9 months ago
    Towards Effective and Interpretable Data Mining by Visual Interaction
    Download  www.charuaggarwal.net
    The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
    Charu C. Aggarwal
    claim paper
    Read More »
    SIGIR
    2002
    ACM
    152views Information Technology» more  SIGIR 2002»
    Unsupervised document classification using sequential information maximization
    13 years 9 months ago
    Unsupervised document classification using sequential information maximization
    Download  www.cs.huji.ac.il
    We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
    Noam Slonim, Nir Friedman, Naftali Tishby
    claim paper
    Read More »
    SIGIR
    2002
    ACM
    147views Information Technology» more  SIGIR 2002»
    A new family of online algorithms for category ranking
    13 years 9 months ago
    A new family of online algorithms for category ranking
    Download  net.pku.edu.cn
    We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
    Koby Crammer, Yoram Singer
    claim paper
    Read More »
    TIT
    1998
    90views more  TIT 1998»
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    13 years 9 months ago
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    Download  www.cst.uwaterloo.ca
    —Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
    Amir H. Banihashemi, Amir K. Khandani
    claim paper
    Read More »
    TIP
    1998
    137views more  TIP 1998»
    Blocking effect reduction of JPEG images by signal adaptive filtering
    13 years 9 months ago
    Blocking effect reduction of JPEG images by signal adaptive filtering
    Download  koasas.kaist.ac.kr
    Abstract—A postprocessing algorithm is proposed to reduce the blocking artifacts of Joint Photographic Experts Group (JPEG) decompressed images. The reconstructed images from JPE...
    Y. L. Lee, H. C. Kim, H. W. Park
    claim paper
    Read More »
    TIP
    1998
    240views more  TIP 1998»
    DCT-based motion estimation
    13 years 9 months ago
    DCT-based motion estimation
    Download  www.cspl.umd.edu
    —We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
    Ut-Va Koc, K. J. Ray Liu
    claim paper
    Read More »
    SIAMDM
    2002
    85views more  SIAMDM 2002»
    Finding a 2-Core of a Tree in Linear Time
    13 years 9 months ago
    Finding a 2-Core of a Tree in Linear Time
    Download  www.cs.ust.hk
    Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
    Biing-Feng Wang
    claim paper
    Read More »
    SIAMCOMP
    2002
    138views more  SIAMCOMP 2002»
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    13 years 9 months ago
    Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
    Download  www.math.uni-frankfurt.de
    We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
    Hsien-Kuei Hwang, Ralph Neininger
    claim paper
    Read More »
    « first‹ previous…798081828384858687…next ›last »
    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.