Sciweavers

1265 search results - page 88 / 253
» Finding the Key to a Synapse
Sort
View
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 9 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
13 years 9 months ago
The Swap Edges of a Multiple-Sources Routing Tree
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
AUTOMATICA
2008
83views more  AUTOMATICA 2008»
13 years 9 months ago
Periodic smoothing splines
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
13 years 9 months ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
CCR
2010
81views more  CCR 2010»
13 years 9 months ago
Perspectives on tracing end-hosts: a survey summary
There is an amazing paucity of data that is collected directly on users' personal computers. One key reason for this is the perception among researchers that users are unwill...
Diana Joumblatt, Renata Teixeira, Jaideep Chandras...