Sciweavers

    PAAPP
    2007
    104views more  PAAPP 2007»
    Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
    13 years 9 months ago
    Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
    Download  sensorweb.cs.gsu.edu
    Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
    Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...
    claim paper
    Read More »
    OL
    2007
    133views more  OL 2007»
    An SQP-type algorithm for nonlinear second-order cone programs
    13 years 9 months ago
    An SQP-type algorithm for nonlinear second-order cone programs
    Download  www.amp.i.kyoto-u.ac.jp
    We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
    Hirokazu Kato, Masao Fukushima
    claim paper
    Read More »
    MVA
    2007
    179views Computer Vision» more  MVA 2007»
    Multi-object trajectory tracking
    13 years 9 months ago
    Multi-object trajectory tracking
    Download  users.soe.ucsc.edu
    The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
    Mei Han, Wei Xu, Hai Tao, Yihong Gong
    claim paper
    Read More »
    MTA
    2007
    101views more  MTA 2007»
    Finding maximum-length repeating patterns in music databases
    13 years 9 months ago
    Finding maximum-length repeating patterns in music databases
    Download  delab.csd.auth.gr
    Abstract This paper introduces the problem of discovering maximum-length repeating patterns in music objects. A novel algorithm is presented for the extraction of this kind of patt...
    Ioannis Karydis, Alexandros Nanopoulos, Yannis Man...
    claim paper
    Read More »
    ISCI
    2008
    107views more  ISCI 2008»
    Constructing vertex-disjoint paths in (n, k)-star graphs
    13 years 9 months ago
    Constructing vertex-disjoint paths in (n, k)-star graphs
    Download  par.cse.nsysu.edu.tw
    This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
    Tsung-Chi Lin, Dyi-Rong Duh
    claim paper
    Read More »
    ML
    2007
    ACM
    192views Machine Learning» more  ML 2007»
    Annealing stochastic approximation Monte Carlo algorithm for neural network training
    13 years 9 months ago
    Annealing stochastic approximation Monte Carlo algorithm for neural network training
    Download  www.stat.tamu.edu
    We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
    Faming Liang
    claim paper
    Read More »
    ML
    2007
    ACM
    153views Machine Learning» more  ML 2007»
    Multi-Class Learning by Smoothed Boosting
    13 years 9 months ago
    Multi-Class Learning by Smoothed Boosting
    Download  www.springerlink.com
    AdaBoost.OC has been shown to be an effective method in boosting “weak” binary classifiers for multi-class learning. It employs the Error-Correcting Output Code (ECOC) method ...
    Rong Jin, Jian Zhang 0003
    claim paper
    Read More »
    MICS
    2007
    100views more  MICS 2007»
    A New Method for Real Root Isolation of Univariate Polynomials
    13 years 9 months ago
    A New Method for Real Root Isolation of Univariate Polynomials
    Download  www.is.pku.edu.cn
    A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
    Ting Zhang, Bican Xia
    claim paper
    Read More »
    IJDSN
    2008
    81views more  IJDSN 2008»
    A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
    13 years 9 months ago
    A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
    Download  www.eecs.wsu.edu
    This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
    Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
    claim paper
    Read More »
    CORR
    2008
    Springer
    116views Education» more  CORR 2008»
    Polynomial Filtering for Fast Convergence in Distributed Consensus
    13 years 9 months ago
    Polynomial Filtering for Fast Convergence in Distributed Consensus
    Download  lts4www.epfl.ch
    Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
    Effrosini Kokiopoulou, Pascal Frossard
    claim paper
    Read More »
    « first‹ previous…515253545556575859…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.