Sciweavers

3897 search results - page 245 / 780
» complexity 2010
Sort
View
RTA
2010
Springer
15 years 10 months ago
Polynomially Bounded Matrix Interpretations
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
Johannes Waldmann
SIGGRAPH
2010
ACM
15 years 10 months ago
Exploration of bat wing morphology through a strip method and visualization
We present a visual exploration tool that lets biologists navigate through complex bat wing geometries by combining a novel modeling method and an interactive visualization approa...
Jian Chen, Daniel K. Riskin, Tatjana Y. Hubel, Dav...
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 10 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
ACNS
2010
Springer
114views Cryptology» more  ACNS 2010»
15 years 9 months ago
Two New Efficient PIR-Writing Protocols
Assume that a client outsources his database to a remote storage-provider (the server), so that for privacy reasons, the client's database is encrypted by his secret key. Duri...
Helger Lipmaa, Bingsheng Zhang
ICPR
2010
IEEE
15 years 8 months ago
Learning Probabilistic Models of Contours
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
Laure Amate, Maria João Rendas